Prime Implicate Tries
نویسندگان
چکیده
The prime implicate trie (pi-trie) of a logical formula is a tree whose branches are labeled with the prime implicates of the formula. The technology of reduced implicate tries is employed to analyze the structure of pi-tries. Appropriate lemmas and theorems are proved, and an algorithm that builds the pi-trie from a logical formula is developed. Preliminary experimental results are presented.
منابع مشابه
Prime Implicates and Reduced Implicate Tries
The reduced implicate trie (ri-trie) is a data structure that was introduced as a target language for knowledge compilation. It has the property that, even when large, it guarantees fast response to queries. It also has the property that each prime implicate of the formula it represents corresponds to a branch. In this paper, those prime branches are characterized, and a technique is developed ...
متن کاملPrime Implicate Normal Form for ALC Concepts
In this paper, we present a new normal form for concept expressions in the description logic ALC which is based on a recently introduced notion of prime implicate. We show that concepts in prime implicate normal form enjoy a number of desirable properties which make prime implicate normal form interesting from the viewpoint of knowledge compilation. In particular, we prove that subsumption betw...
متن کاملReduced Implicate/Implicant Tries
The reduced implicate trie, introduced in [10], is a data structure that may be used as a target language for knowledge compilation. It has the property that a query can be processed in time linear in the size of the query, regardless of the size of the compiled knowledge base. This data structure can be used with propositional databases, where a query amounts to asking whether a clause is an i...
متن کاملReduced Implicate Tries and Logical Operations
The reduced implicate trie (ri-trie), introduced in (Murray and Rosenthal, 2005), is a target language for knowledge compilation. It has the property that any query can be processed in time linear in the size of the query. In this paper, conjunction and negation are developed as update operations for ri-tries that do not require recompilation. Conjunction has been implemented, and experimental ...
متن کاملThe Maximum Length of Prime Implicates for Instances of 3-SAT
Schrag and Crawford ( 1996) present strong experimental evidence that the occurrence of prime implicates of varying lengths in random instances of 3-SAT exhibits behaviour similar to the wellknown phase transition phenomenon associated with satisfiability. Thus, as the ratio of number of clauses (m) to number of propositional variables (n) increases, random instances of 3-SAT progress from form...
متن کامل